Precise Interprocedural Dataaow Analysis with Applications to Constant Propagation 1
نویسندگان
چکیده
This paper concerns interprocedural dataaow-analysis problems in which the dataaow information at a program point is represented by an environment (i.e., a mapping from symbols to values), and the eeect of a program operation is represented by a distributive environment transformer. We present an eecient dynamic-programming algorithm that produces precise solutions. The method is applied to solve precisely and eeciently two (decidable) variants of the interprocedural constant-propagation problem: copy constant propagation and linear constant propagation. The former interprets program statements of the form x := 7 and x := y. The latter also interprets statements of the form x := 5 y + 17.
منابع مشابه
Pro le - Guided Context - Sensitive Program Analysis
Interprocedural analyses can be classiied as either context-insensitive, which tend to sacri-ce precision to gain eeciency, or context-sensitive, which are more precise but also more expensive. This paper discusses a proole-guided approach to interprocedural analysis that is context-sensitive, and hence more precise, for the \important" call sites for a function, and context-insensitive, and he...
متن کاملPrecise Interprocedural Dataflow Analysis with Applications to Constant Propagation
This paper concerns inter-procedural dataflow-analysis problems in which the dataflow information at a program point is represented by an environment (i.e., a mapping from symbols to values), and the effect of a program operation is represented by a distributive environment transformer. We present two efficient algorithms that produce precise solutions: an exhaustive algorithm that finds values...
متن کاملFaster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth
Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, etc. Recursive state machines (RSMs) are standard models for interprocedural analysis. We consider a general framework with RSMs where the transitions are labeled from a semiring, and path properties are algebraic with semiring operations. RSMs with algebraic...
متن کاملPMACS: An Environment for Parallel Programming
In this paper, we present a parallel programming environment called PMACS. The central structure of this environment is the Parametrized Dependence Graph that gives a very precise representation of dependencies. It also facilitates the recompilation of dependencies whenever the user is requested to introduce information about the program. A unique framework for the interprocedural constant prop...
متن کاملAn Interprocedural Parallelizing Compiler and Its Support for Memory Hierarchy Research
We present several new compiler techniques employed by our interprocedural parallelizing research compiler, Panorama, to improve loop parallelization and the eeciency of memory references. We rst present an overview of the compiler and its associated memory architecture simulation environments. We then present an interprocedural array dataaow analysis, using guarded array regions, for automatic...
متن کامل